Large nearest neighbour balls in hyperbolic stochastic geometry
نویسندگان
چکیده
Abstract Consider a stationary Poisson process in d -dimensional hyperbolic space. For $$R>0$$ R > 0 define the point $$\xi _R^{(k)}$$ ξ ( k ) of exceedance heights over suitable threshold volumes k th nearest neighbour balls centred around points within ball radius R at fixed point. The is compared to an inhomogeneous on real line with intensity function $$e^{-u}$$ e - u and convergence Kantorovich-Rubinstein distance shown. From this, quantitative limit theorem for maximum limiting Gumbel distribution derived.
منابع مشابه
Approximating Covering and Minimum Enclosing Balls in Hyperbolic Geometry
We generalize the O( dn 2 )-time (1 + )-approximation algorithm for the smallest enclosing Euclidean ball [2, 10] to point sets in hyperbolic geometry of arbitrary dimension. We guarantee a O ( 1/ 2 ) convergence time by using a closed-form formula to compute the geodesic α-midpoint between any two points. Those results allow us to apply the hyperbolic k-center clustering for statistical locati...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEnhanced Nearest Neighbour
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...
متن کاملFuzzy-Rough Nearest Neighbour Classification
A new fuzzy-rough nearest neighbour (FRNN) classification algorithm is presented in this paper, as an alternative to Sarkar’s fuzzyrough ownership function (FRNN-O) approach. By contrast to the latter, our method uses the nearest neighbours to construct lower and upper approximations of decision classes, and classifies test instances based on their membership to these approximations. In the exp...
متن کاملOptimal weighted nearest neighbour classifiers
We derive an asymptotic expansion for the excess risk (regret) of a weighted nearest-neighbour classifier. This allows us to find the asymptotically optimal vector of nonnegative weights, which has a rather simple form. We show that the ratio of the regret of this classifier to that of an unweighted k-nearest neighbour classifier depends asymptotically only on the dimension d of the feature vec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Extremes
سال: 2023
ISSN: ['1386-1999', '1572-915X']
DOI: https://doi.org/10.1007/s10687-023-00470-0